An Indexing Structure for Automatic Schema Matching

نویسندگان

  • Fabien Duchateau
  • Zohra Bellahsene
  • Mark Roantree
  • Mathieu Roche
چکیده

Querying semantically related data sources depends on the ability to map between their schemas. Unfortunately, in most cases matching between schema is still largely performed manually or semi-automatically. Consequently, the issue of finding semantic mappings became the principal bottleneck in the deployment of the mediation systems in large scale where the number of ontologies and or schemata to be put in correspondence is very large. Currently the mapping tools employ techniques for mapping two schemas at a time with human intervention for ensuring a good quality of mappings. In the large-scale scenario such techniques are not suitable. Indeed, in such a scenario one requires an automated performance oriented solution. Moreover, the automated method should also provide acceptable quality of mappings. In this paper, we present an automatic schema matching approach dealing with two aspects: performance and quality of mappings. However, we will focus on the performance aspect. For this, our method uses a B-tree index structure. Furthermore, our approach has been implemented and the experiments with real sets of schema show that it is scalable and provides very good performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Semantic Schema Matching Approach

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

متن کامل

BMatch: a Semantically Context-based Tool Enhanced by an Indexing Structure to Accelerate Schema Matching

Abstract. Schema matching is a crucial task to gather information of the same domain. This is more true on the web, where a large number of data sources are available and require to be matched. However, the schema matching process is still largely performed manually or semiautomatically, discouraging the deployment of large-scale integration systems. Indeed, these large-scale scenarios need a s...

متن کامل

Designing a Knowledge-based Schema Matching System for Schema Mapping

Schema mapping that provides a unified view to the users is necessary to manage schema heterogeneity among different data sources. Schema matching is a required task for schema mapping that finds semantic correspondences between entity pairs of schemas. Semi-automatic schema matching systems were developed to overcome manual works for schema mapping. However, such approaches require a high manu...

متن کامل

A Survey Of Approaches To Automatic Schema Matching Bibtex

ous business domains for automatic discovery, mediation and invocation of services over the Core or BibTEX. The use of such an Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. VLDB Journal: Very. BibTeX. @MISC(Rizopoulos_schemamatching, author = (Nikos Rizopoulos), 1126, A survey of approaches to automatic schema matching Rahm, Bernstein. The Linked Data paradigm ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007